NUMBER OF CONFLICTS AT THE ROUTE INTERSECTION – MINIMUM DISTANCE MODEL
نویسندگان
چکیده
منابع مشابه
Some lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملthe use of appropriate madm model for ranking the vendors of mci equipments using fuzzy approach
abstract nowadays, the science of decision making has been paid to more attention due to the complexity of the problems of suppliers selection. as known, one of the efficient tools in economic and human resources development is the extension of communication networks in developing countries. so, the proper selection of suppliers of tc equipments is of concern very much. in this study, a ...
15 صفحه اولthe effect of using model essays on the develpment of writing proficiency of iranina pre-intermediate efl learners
abstract the present study was conducted to investigate the effect of using model essays on the development of writing proficiency of iranian pre-intermediate efl learners. to fulfill the purpose of the study, 55 pre- intermediate learners of parsa language institute were chosen by means of administering proficiency test. based on the results of the pretest, two matched groups, one as the expe...
a synchronic and diachronic approach to the change route of address terms in the two recent centuries of persian language
terms of address as an important linguistics items provide valuable information about the interlocutors, their relationship and their circumstances. this study was done to investigate the change route of persian address terms in the two recent centuries including three historical periods of qajar, pahlavi and after the islamic revolution. data were extracted from a corpus consisting 24 novels w...
15 صفحه اولOn the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets
Let P and Q be disjoint point sets with 2k and 2l elements respectively, and M1 and M2 be their minimum weight perfect matchings (with respect to edge lengths). We prove that the edges of M1 and M2 intersect at most |M1| + |M2| − 1 times. This bound is tight. We also prove that P and Q have perfect matchings (not necessarily of minimum weight) such that their edges intersect at most min{r, s} t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Aviation
سال: 2019
ISSN: 1648-7788,1822-4180
DOI: 10.3846/aviation.2019.9746